package leetcode.dynamic;

public class Lc1143 {

    public int longestCommonSubsequence(String text1, String text2) {
        int m = text1.length();
        int n = text2.length();
        int[][] dp = new int[m + 1][n + 1];
        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <=n; j++) {
                dp[i][j] = Math.max(dp[i-1][j], dp[i][j-1]);
                if (text1.charAt(i - 1) == text2.charAt(j - 1)) {
                    dp[i][j] = dp[i-1][j-1] + 1;
                }
            }
        }
        return dp[m][n];
    }


    public static void main(String[] args) {
        Lc1143 lc1143 = new Lc1143();
        String t1 = "abcde";
        String t2 = "ace";
        System.out.println(lc1143.longestCommonSubsequence(t1, t2));
    }
}
